منابع مشابه
Currying of Order-Sorted Term Rewriting Systems
Term rewriting system is a helpful tool for implementing functional programming languages. We focus upon a transformation of term rewriting systems called currying. Currying transforms a term rewriting system with symbols of arbitrary arity into another one, which contains only nullary symbols with a single binary symbol called application. Currying in single-sorted case is explored in [1] but ...
متن کاملOrder-Sorted Rewriting and Congruence Closure
Order-sorted type systems supporting inheritance hierarchies and subtype polymorphism are used in theorem proving, AI, and declarative programming. The satisfiability problems for the theories of: (i) order-sorted uninterpreted function symbols, and (ii) of such symbols modulo a subset Δ of associative-commutative ones are reduced to the unsorted versions of such problems at no extra computatio...
متن کاملOn Modularity of the Completeness in Order-Sorted Term Rewriting Systems
In this paper, we extend the results on the modularity of con uence and termination of single-sorted TRSs[3][6][7] to order-sorted ones. Order-sorted TRSs build a good framework for handling overloaded functions and subtypes. For proving modularity of completeness of ordersorted TRSs, we rst transform a TRS with overloaded functions to a non-overloaded one, and then we demonstrate that our tran...
متن کاملKAWABE and ISHII : THE COMPLETENESS OF ORDER - SORTED TERM REWRITING SYSTEMS IS PRESERVED
The currying of term rewriting systems (TRSs) is a transformation of TRSs from a functional form to an applicative form. We have already introduced an order-sorted version of currying and proved that the compatibility and con uence of order-sorted TRSs were preserved by currying[3]. In this paper, we focus on a key property of TRSs, completeness. We rst show some proofs omitted in ref.[3]. Then...
متن کاملFree Sequentially in Orthogonal Order-Sorted Rewriting Systems with Constructors
We introduce the notions of sequentiality and strong sequentiality in order-sorted rewriting systems, both closely related to the subsort order and to the form of declarations of the signature. We deene free sequentiality for the class of orthogonal systems with constructors, a notion which does not impose conditions over the signature. We provide an eeective decision procedure for free sequent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1991
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/34.1.16